A Lazy Splitting System for Forum
نویسندگان
چکیده
A number of formalisms based on Linear Logic have been successfully employed for specifying concurrent systems. Nevertheless, there has been a much minor interest in providing an eecient implementation of them. An inconvenience of some of these approaches is the non-determinism generated by the resource management. One of the most expressive Linear Logic based formalisms is Forum, a speciication logic providing both abstraction and concurrency into a declarative setting. In this paper, we deene a lazy splitting system for Forum providing a nearly deterministic resource assignment. We also propose a new stack-based scope control mechanism , improving other proposals and having both a declarative and an operational reading.
منابع مشابه
A Progressive Algorithm for Three Point Transport
When computing global illumination in environments made up of surfaces with general Bidirectional Reflection Distribution Function, a three point formulation of the rendering equation can be used. Brute-force algorithms can lead to a linear system of equations whose matrix is cubic, which is expensive in time and space. The hierarchical approach is more efficient. Aupperle et al. proposed a hie...
متن کاملDynamic Galois Theory
Given a separable polynomial over a field, every maximal idempotent of its splitting algebra defines a representation of its splitting field. Nevertheless such an idempotent is not computable when dealing with a computable field if this field has no factorization algorithm for separable polynomials. Moreover, even when such an algorithm does exist, it is often too heavy. So we suggest to addres...
متن کاملSpatial Directional Radiance Caching
We present a new approach for accelerated global illumination computation in scenes with glossy surfaces. Our algorithm combines sparse illumination computation used in the radiance caching algorithm with BRDF importance sampling. To make this approach feasible, we extend the idea of lazy illumination evaluation, used in the caching approaches, from the spatial to the directional domain. Using ...
متن کاملState Focusing: Lazy Abstraction for the Mu-Calculus
A key technique for the verification of programs is counterexampleguided abstraction refinement (CEGAR). In a previous approach, we developed a CEGAR-based algorithm for the modal μ-calculus, where refinement applies only locally, i.e. lazy abstraction techniques are used. Unfortunately, our previous algorithm was not completely lazy and had some further drawbacks, like a possible local state e...
متن کاملPerformance Analysis of cooperative SWIPT System: Intelligent Reflecting Surface versus Decode-and-Forward
In this paper, we explore the impacts of utilizing intelligent reflecting surfaces (IRS) in a power-splitting based simultaneous wireless information and power transfer (PS-SWIPT) system and compare its performance with the traditional decode and forward relaying system. To analyze a more practical system, it is also assumed that the receiving nodes are subject to decoding cost, and they are on...
متن کامل